Checkers: A Preview of What Will Happen in Chess?
نویسنده
چکیده
The checkers program Chinook has earned the right to challenge for the World Checkers Championship. The experiences gained in developing the program and preparing for the match illustrate several important obstacles to successfully mounting a challenge to the human World Champion. These points appear to be directly applicable to chess, and the checkers experience may well be a preview of what is to come in chess.
منابع مشابه
WYSIWYG-Tool Tips: Enhancing Tool Tips with Translucent Preview Bitmaps
This paper suggests to enhance the concept of tool tips by presenting translucent preview bitmaps. The basic idea is to give the user a preview of what would happen when a certain operation is invoked. We have implemented two prototypes to evaluate the concept. One provides WYSIWYG (What You See Is What You Get) tool tips for documents and applications on the desktop. The second one is an appli...
متن کاملOn the Complexity of Chess
Most past work analyzing games from the point of view of computational complexity has dealt with combinatorial games on graphs (e.g., Even and Tarjan (31, Schaefer [lo], Chandra and Stockmeyer [2]). H owever, recently Fraenkel et al. [S], and Lichtenstein and Sipser [8] have considered the game of checkers and GO, respectively. These authors show that for generalizations of checkers and GO to a...
متن کاملCombinatorial Games: From Theoretical Solving to AI Algorithms
Combinatorial game solving is a research field that is frequently highlighted each time a program defeats the best human player: Deep Blue (IBM) vs Kasparov for Chess in 1997, and Alpha Go (Google) vs Lee Sedol for the game of Go in 2016. But what is hidden behind these success stories ? First of all, I will consider combinatorial games from a theoretical point of view. We will see how to proce...
متن کاملApplying the Experience of Building a High-Performance Search Engine for One Domain to Another
This paper describes the high-performance alpha-beta-based search engine used in CHINOOK, the World Man-Machine Checkers Champion. Previous experience in designing a chess program was important in the initial design of the program. As it evolved, however, numerous application-specific modifications had to be made for the algorithms to excel at searching checkers trees. This paper describes the ...
متن کاملMTD(f), A Minimax Algorithm Faster Than NegaScout
MTD(f) is a new minimax search algorithm, simpler and more efficient than previous algorithms. In tests with a number of tournament game playing programs for chess, checkers and Othello it performed better, on average, than NegaScout/PVS (the AlphaBeta variant used in practically all good chess, checkers, and Othello programs). One of the strongest chess programs of the moment, MIT's parallel c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ICGA Journal
دوره 14 شماره
صفحات -
تاریخ انتشار 1991